#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
const ll maxn = 1000;
ll m[maxn][maxn];
//把n拆分后最大差分数不超过k的方案数
ll dp(ll n, ll k)
{
    if (n == 1 || k == 1)
        return m[n][k] = 1;
    if (n < k)
        return m[n][n] = dp(n, n);
    if (n == k)
        return m[n][k] = dp(n, k - 1) + 1;
    if (n > k)
        return m[n][k] = dp(n - k, k) + dp(n, k - 1);
}
int main()
{
    IOS;
    ll n;
    while (cin >> n)
    {
        cout << dp(n, 1) << endl;
    }
    getchar();
    getchar();
    return 0;
}
